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 14, 2026 20:12boop34boop34Score: 13,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 20:1213,518121,974,792111,153,0001,051,0002,113,536
2Jul 14, 2026 20:1213,526121,935,889111,240,0001,031,0002,113,536
3Jul 14, 2026 20:1213,528121,951,282111,242,0001,044,0002,113,536
4Jul 14, 2026 20:1213,532122,067,443111,284,0001,039,0002,113,536
5Jul 14, 2026 20:1213,532122,041,186111,261,0001,055,0002,113,536
6Jul 14, 2026 20:1213,998125,919,729115,141,0001,047,0002,113,536
7Jul 14, 2026 20:1214,010126,538,510115,241,0001,049,0002,113,536
8Jul 14, 2026 20:1214,033126,786,983115,418,0001,059,0002,113,536
9Jul 14, 2026 20:1214,168127,831,865116,521,0001,079,0002,113,536