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 listMar 10, 2026 16:38Josu San MartinJosu San MartinScore: 5,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 16:385,01668,391,62238,590,0003,046,0002,277,376
2Mar 10, 2026 16:385,10562,960,14140,355,0002,017,0002,404,352
3Mar 10, 2026 16:385,10765,540,90140,368,0002,018,0002,408,448
4Mar 10, 2026 16:385,34969,161,12643,390,0001,009,0002,404,352
5Mar 10, 2026 16:385,37874,110,70343,623,0001,014,0002,277,376
6Mar 10, 2026 16:385,53171,160,14542,916,0002,994,0002,408,448