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 13, 2026 18:55boop34boop34Score: 20,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2026 18:5620,205178,024,433166,694,0001,010,0002,113,536
2Jul 13, 2026 18:5620,552180,408,257169,574,0001,010,0002,113,536
3Jul 13, 2026 18:5620,668181,328,608170,536,0001,009,0002,113,536
4Jul 13, 2026 18:5620,670181,311,185170,559,0001,010,0002,113,536
5Jul 13, 2026 18:5620,671181,254,923170,566,0001,011,0002,113,536
6Jul 13, 2026 18:5620,672181,899,843170,570,0001,012,0002,113,536
7Jul 13, 2026 18:5620,675181,412,196170,597,0001,010,0002,113,536
8Jul 13, 2026 18:5620,677181,994,693170,617,0001,010,0002,113,536
9Jul 13, 2026 18:5620,678181,981,909170,622,0001,009,0002,113,536