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:30Kevin HeaveyKevin HeaveyScore: 3,959Success
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:323,90342,112,89831,378,0001,021,0002,117,632
2Jul 12, 2026 15:323,90342,073,54431,123,0001,279,0002,117,632
3Jul 12, 2026 15:323,94742,534,72731,555,0001,212,0002,117,632
4Jul 12, 2026 15:323,95642,425,09231,632,0001,206,0002,117,632
5Jul 12, 2026 15:323,95942,454,77631,623,0001,237,0002,117,632
6Jul 12, 2026 15:323,96242,476,83331,580,0001,310,0002,117,632
7Jul 12, 2026 15:323,96852,580,92231,914,0001,025,0002,117,632
8Jul 12, 2026 15:323,98651,544,88331,881,0001,208,0002,117,632
9Jul 12, 2026 15:324,26753,499,97334,341,0001,076,0002,117,632