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 14, 2026 23:41Kevin HeaveyKevin HeaveyScore: 3,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 23:423,84541,601,10930,893,0001,028,0002,117,632
2Jul 14, 2026 23:423,85341,673,89630,961,0001,023,0002,117,632
3Jul 14, 2026 23:423,86242,023,54131,037,0001,023,0002,117,632
4Jul 14, 2026 23:423,86941,663,92231,078,0001,042,0002,117,632
5Jul 14, 2026 23:423,87141,784,22331,107,0001,027,0002,117,632
6Jul 14, 2026 23:423,87341,754,15731,128,0001,023,0002,117,632
7Jul 14, 2026 23:423,88441,900,20431,196,0001,043,0002,117,632
8Jul 14, 2026 23:423,88541,895,31131,205,0001,041,0002,117,632
9Jul 14, 2026 23:423,89641,917,94631,296,0001,044,0002,117,632