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 12, 2026 15:19Kevin HeaveyKevin HeaveyScore: 3,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 15:203,87641,732,42331,149,0001,026,0002,117,632
2Jul 12, 2026 15:203,88041,755,66030,989,0001,216,0002,117,632
3Jul 12, 2026 15:203,88442,528,65331,224,0001,021,0002,117,632
4Jul 12, 2026 15:203,88441,800,99831,210,0001,028,0002,117,632
5Jul 12, 2026 15:203,88642,348,21031,233,0001,025,0002,117,632
6Jul 12, 2026 15:203,89141,910,13231,007,0001,289,0002,117,632
7Jul 12, 2026 15:203,93342,274,03631,442,0001,209,0002,117,632
8Jul 12, 2026 15:203,93942,247,15431,665,0001,036,0002,117,632
9Jul 12, 2026 15:203,94142,270,92031,680,0001,034,0002,117,632