Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJul 6, 2026 22:38boop34boop34Score: 535,703Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:41457,82417,421,856,965856,464,0002,943,480,0002,113,536
2Jul 6, 2026 22:41464,39117,946,407,500863,725,0002,990,723,0002,113,536
3Jul 6, 2026 22:41464,47917,843,946,656848,586,0003,006,590,0002,138,112
4Jul 6, 2026 22:41533,55417,944,026,7671,077,126,0003,351,377,0002,117,632
5Jul 6, 2026 22:41535,70317,532,701,9671,072,625,0003,373,713,0002,154,496
6Jul 6, 2026 22:41538,04818,268,349,1551,079,501,0003,386,305,0002,125,824
7Jul 6, 2026 22:41539,25318,134,559,1221,108,415,0003,367,388,0002,142,208
8Jul 6, 2026 22:41539,87117,854,447,8531,087,055,0003,393,879,0002,162,688
9Jul 6, 2026 22:41545,08118,184,608,5931,043,644,0003,480,534,0002,166,784