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 11, 2026 07:09wnwnScore: 3,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:103,29735,004,53327,367,00002,113,536
2May 11, 2026 07:103,31536,515,85227,519,00002,113,536
3May 11, 2026 07:103,32837,817,43726,516,0001,112,0002,113,536
4May 11, 2026 07:103,39336,877,04528,170,00002,113,536
5May 11, 2026 07:103,45137,453,16628,645,00002,113,536
6May 11, 2026 07:103,45238,297,46327,650,0001,006,0002,113,536
7May 11, 2026 07:103,46339,285,88228,747,00002,113,536
8May 11, 2026 07:103,48638,796,15828,935,00002,113,536
9May 11, 2026 07:103,48938,784,22528,963,00002,113,536