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 listOct 13, 2026 06:49e1011e1011Score: 58,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 06:4958,504496,848,109429,349,00056,238,0002,113,536
2Oct 13, 2026 06:4958,551496,526,607429,536,00056,444,0002,113,536
3Oct 13, 2026 06:4958,567498,861,704429,927,00056,180,0002,113,536
4Oct 13, 2026 06:4958,608497,793,558431,213,00055,241,0002,113,536
5Oct 13, 2026 06:4958,663497,497,767430,589,00056,317,0002,113,536
6Oct 13, 2026 06:4958,666497,575,230430,529,00056,400,0002,113,536
7Oct 13, 2026 06:4958,680497,494,256430,831,00056,213,0002,113,536
8Oct 13, 2026 06:4958,680498,318,672430,869,00056,178,0002,113,536
9Oct 13, 2026 06:4958,693498,271,632430,817,00056,341,0002,113,536