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 listOct 27, 2026 15:32boop34boop34Score: 8,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2026 15:328,84984,221,91872,348,0001,100,0002,117,632
2Oct 27, 2026 15:328,85682,774,61272,484,0001,024,0002,117,632
3Oct 27, 2026 15:328,87883,107,27372,669,0001,021,0002,117,632
4Oct 27, 2026 15:328,91883,477,62072,972,0001,054,0002,117,632
5Oct 27, 2026 15:328,92083,477,12773,002,0001,039,0002,117,632
6Oct 27, 2026 15:328,93283,498,74573,125,0001,018,0002,117,632
7Oct 27, 2026 15:328,94983,697,33873,148,0001,130,0002,117,632
8Oct 27, 2026 15:329,03384,329,99373,952,0001,025,0002,117,632
9Oct 27, 2026 15:329,17485,592,91375,116,0001,032,0002,117,632