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 11:27Josu San MartinJosu San MartinScore: 4,081Success
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 11:304,06047,978,01932,606,0001,099,0002,486,272
2May 10, 2026 11:304,07346,033,05032,699,0001,111,0002,465,792
3May 10, 2026 11:304,07647,685,11132,713,0001,122,0002,490,368
4May 10, 2026 11:304,07748,988,18032,714,0001,126,0002,478,080
5May 10, 2026 11:304,08150,486,01232,748,0001,130,0002,494,464
6May 10, 2026 11:304,08447,927,05132,802,0001,099,0002,486,272
7May 10, 2026 11:304,08547,898,17332,795,0001,115,0002,486,272
8May 10, 2026 11:304,11251,518,47332,978,0001,155,0002,486,272
9May 10, 2026 11:304,11949,617,04233,071,0001,122,0002,486,272