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 10, 2026 18:16Victor MerckléVictor MerckléScore: 4,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 18:164,06941,912,11032,560,0001,217,0002,117,632stderr
2Aug 10, 2026 18:164,07641,978,56632,606,0001,226,0002,117,632stderr
3Aug 10, 2026 18:164,07942,207,25432,638,0001,219,0002,117,632stderr
4Aug 10, 2026 18:164,08042,027,33032,636,0001,230,0002,117,632stderr
5Aug 10, 2026 18:164,08442,184,92932,667,0001,231,0002,117,632stderr
6Aug 10, 2026 18:164,08942,198,60432,731,0001,208,0002,117,632stderr
7Aug 10, 2026 18:164,09943,093,01932,810,0001,214,0002,117,632stderr
8Aug 10, 2026 18:164,10942,381,83332,931,0001,181,0002,117,632stderr
9Aug 10, 2026 18:164,11942,401,66133,006,0001,187,0002,117,632stderr