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 7, 2026 08:34wnwnScore: 3,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 08:343,38243,585,82327,014,0001,063,0002,482,176
2May 7, 2026 08:343,39245,410,26027,048,0001,107,0002,482,176
3May 7, 2026 08:343,40043,894,33227,089,0001,134,0002,490,368
4May 7, 2026 08:343,40343,926,13727,171,0001,081,0002,486,272
5May 7, 2026 08:343,41543,256,56427,295,0001,054,0002,482,176
6May 7, 2026 08:343,42044,690,65327,291,0001,097,0002,486,272
7May 7, 2026 08:343,56846,562,93328,507,0001,112,0002,490,368
8May 7, 2026 08:343,58943,565,82028,736,0001,054,0002,498,560
9May 7, 2026 08:343,59144,434,76328,706,0001,104,0002,486,272