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 listJul 15, 2026 11:11boop34boop34Score: 14,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 11:1414,029126,747,641106,692,0009,753,0002,113,536
2Jul 15, 2026 11:1414,043126,234,958105,461,00011,102,0002,113,536
3Jul 15, 2026 11:1414,130127,385,996106,689,00010,592,0002,113,536
4Jul 15, 2026 11:1414,232128,458,305106,337,00011,796,00020,480
5Jul 15, 2026 11:1414,242128,562,666106,901,00011,314,0002,113,536
6Jul 15, 2026 11:1414,270128,633,273106,867,00011,581,0002,113,536
7Jul 15, 2026 11:1414,294128,994,795106,420,00012,224,00020,480
8Jul 15, 2026 11:1414,312128,770,849106,442,00012,348,0002,113,536
9Jul 15, 2026 11:1414,321128,604,902107,051,00011,818,0002,113,536