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 listMay 10, 2026 08:12Josu San MartinJosu San MartinScore: 4,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 08:124,09047,093,82032,857,0001,097,0002,486,272
2May 10, 2026 08:124,09849,994,51432,869,0001,146,0002,482,176
3May 10, 2026 08:124,11052,204,72533,090,0001,026,0002,482,176
4May 10, 2026 08:124,11149,408,06032,968,0001,159,0002,486,272
5May 10, 2026 08:124,11651,583,14633,023,0001,143,0002,478,080
6May 10, 2026 08:124,11650,319,42533,031,0001,132,0002,490,368
7May 10, 2026 08:124,11650,916,12233,035,0001,136,0002,482,176
8May 10, 2026 08:124,12151,854,05033,095,0001,117,0002,478,080
9May 10, 2026 08:124,12349,776,86533,096,0001,131,0002,473,984