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 listSep 24, 2026 06:26wnwnScore: 3,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 06:333,51938,076,02727,895,0001,318,0002,113,536
2Sep 24, 2026 06:333,55438,267,85528,039,0001,466,0002,113,536
3Sep 24, 2026 06:333,64539,027,30728,257,0002,000,0002,113,536
4Sep 24, 2026 06:333,66339,159,65728,393,0002,012,0002,113,536
5Sep 24, 2026 06:333,67439,313,27227,375,0003,124,0002,113,536
6Sep 24, 2026 06:333,68239,297,74527,345,0003,219,0002,113,536
7Sep 24, 2026 06:333,72639,687,11929,392,0001,541,0002,113,536
8Sep 24, 2026 06:333,73642,537,77227,665,0003,346,0002,113,536
9Sep 24, 2026 06:333,84141,819,50427,824,0004,060,0002,113,536