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:49wnwnScore: 3,569Success
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:503,39941,355,39927,138,0001,077,0002,490,368
2May 7, 2026 08:503,41343,403,02327,243,0001,091,0002,482,176
3May 7, 2026 08:503,46950,223,69527,737,0001,063,0002,482,176
4May 7, 2026 08:503,56446,208,69728,507,0001,075,0002,482,176
5May 7, 2026 08:503,56946,594,63228,553,0001,074,0002,494,464
6May 7, 2026 08:503,57147,850,66028,560,0001,080,0002,494,464
7May 7, 2026 08:503,57245,343,30628,558,0001,095,0002,490,368
8May 7, 2026 08:503,57743,879,86728,599,0001,098,0002,473,984
9May 7, 2026 08:503,59246,923,16028,721,0001,099,0002,486,272