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 listMay 17, 2026 09:30M-RochatM-RochatScore: 12,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 09:3112,643114,252,733102,742,0002,202,0002,113,536
2May 17, 2026 09:3112,723114,445,957102,370,0003,233,0002,113,536
3May 17, 2026 09:3112,734114,463,683103,510,0002,186,0002,113,536
4May 17, 2026 09:3112,746116,633,129103,575,0002,218,0002,113,536
5May 17, 2026 09:3112,746117,731,676103,621,0002,179,0002,113,536
6May 17, 2026 09:3112,748116,430,427102,544,0003,267,0002,113,536
7May 17, 2026 09:3112,751116,532,105102,653,0003,186,0002,113,536
8May 17, 2026 09:3112,779116,895,113102,831,0003,236,0002,113,536
9May 17, 2026 09:3112,784115,785,093102,898,0003,216,0002,113,536