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 20, 2026 10:09M-RochatM-RochatScore: 7,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:097,51574,725,78060,191,0002,191,0002,113,536
2May 20, 2026 10:097,52071,979,68060,259,0002,162,0002,113,536
3May 20, 2026 10:097,52072,650,97060,257,0002,164,0002,113,536
4May 20, 2026 10:097,52172,555,87960,217,0002,209,0002,113,536
5May 20, 2026 10:097,53273,595,54860,424,0002,097,0002,113,536
6May 20, 2026 10:097,53274,477,06360,375,0002,148,0002,113,536
7May 20, 2026 10:097,56072,254,83560,593,0002,160,0002,113,536
8May 20, 2026 10:097,56075,353,95460,549,0002,207,0002,113,536
9May 20, 2026 10:097,56673,981,96660,629,0002,177,0002,113,536