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 5, 2026 01:10olliecrowolliecrowScore: 7,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 01:107,30477,804,06458,356,0002,275,0002,494,464
2May 5, 2026 01:107,31579,815,87258,563,0002,154,0002,539,520
3May 5, 2026 01:107,35277,585,66358,845,0002,180,0002,510,848
4May 5, 2026 01:107,35577,697,69858,779,0002,272,0002,498,560
5May 5, 2026 01:107,35677,195,28658,755,0002,307,0002,449,408
6May 5, 2026 01:107,37376,859,76658,874,0002,330,0002,453,504
7May 5, 2026 01:107,38281,675,17458,968,0002,304,0002,433,024
8May 5, 2026 01:107,48178,860,75760,054,0002,044,0002,306,048
9May 5, 2026 01:107,52677,052,29360,181,0002,289,0002,531,328