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 09:06Josu San MartinJosu San MartinScore: 4,157Success
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 09:064,09250,300,45832,827,0001,142,0002,486,272
2May 10, 2026 09:064,11350,455,42533,098,0001,040,0002,473,984
3May 10, 2026 09:064,11747,071,36733,032,0001,146,0002,473,984
4May 10, 2026 09:064,15550,369,10933,436,0001,053,0002,486,272
5May 10, 2026 09:064,15749,371,63033,455,0001,050,0002,486,272
6May 10, 2026 09:064,15948,824,37433,414,0001,111,0002,473,984
7May 10, 2026 09:064,17550,302,15633,620,0001,040,0002,490,368
8May 10, 2026 09:064,19150,007,97333,688,0001,100,0002,482,176
9May 10, 2026 09:064,21252,768,40233,851,0001,112,0002,486,272