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 listFeb 9, 2026 18:43nunnunScore: 90,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 18:4390,227775,359,266510,920,000237,963,0002,285,568
2Feb 9, 2026 18:4390,376778,856,483511,401,000238,720,0002,510,848
3Feb 9, 2026 18:4390,587779,677,679511,236,000240,640,0002,285,568
4Feb 9, 2026 18:4390,630779,140,871510,477,000241,752,0002,289,664
5Feb 9, 2026 18:4390,679774,842,149512,753,000239,884,0002,322,432
6Feb 9, 2026 18:4390,835783,140,024510,955,000242,979,0002,494,464
7Feb 9, 2026 18:4391,107785,182,674511,453,000244,738,0002,510,848
8Feb 9, 2026 18:4391,159780,825,836512,742,000243,877,0002,322,432
9Feb 9, 2026 18:4391,504781,840,103510,651,000248,830,0002,363,392