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 12, 2026 14:43boop34boop34Score: 23,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 14:4423,254202,830,135192,006,0001,009,0002,113,536
2Jul 12, 2026 14:4423,304203,434,096191,409,0002,018,0002,113,536
3Jul 12, 2026 14:4423,825207,423,810196,742,0001,009,0002,113,536
4Jul 12, 2026 14:4423,830207,587,029196,780,0001,010,0002,113,536
5Jul 12, 2026 14:4423,840207,620,862195,860,0002,018,0002,113,536
6Jul 12, 2026 14:4423,840207,548,985196,871,0001,007,0002,113,536
7Jul 12, 2026 14:4423,849208,270,589196,940,0001,010,0002,113,536
8Jul 12, 2026 14:4423,948208,426,886197,763,0001,010,0002,113,536
9Jul 12, 2026 14:4424,031209,112,740198,453,0001,009,0002,113,536