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 listAug 27, 2026 01:12Victor MerckléVictor MerckléScore: 3,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 01:133,81039,985,03930,610,0001,015,0002,117,632stderr
2Aug 27, 2026 01:133,82340,035,29730,603,0001,128,0002,117,632stderr
3Aug 27, 2026 01:133,82840,173,41630,673,0001,105,0002,117,632stderr
4Aug 27, 2026 01:133,83140,140,80330,709,0001,096,0002,117,632stderr
5Aug 27, 2026 01:133,83640,211,03930,818,0001,027,0002,117,632stderr
6Aug 27, 2026 01:133,83740,205,64230,817,0001,032,0002,117,632stderr
7Aug 27, 2026 01:133,83840,238,00130,814,0001,043,0002,117,632stderr
8Aug 27, 2026 01:133,84940,316,84530,858,0001,096,0002,117,632stderr
9Aug 27, 2026 01:133,86441,066,33731,057,0001,016,0002,117,632stderr