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 06:06M-RochatM-RochatScore: 11,804Success
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 06:0611,789109,681,67595,526,0002,324,0002,113,536
2May 20, 2026 06:0611,793109,131,05695,552,0002,331,0002,113,536
3May 20, 2026 06:0611,795109,854,99495,574,0002,327,0002,113,536
4May 20, 2026 06:0611,803108,404,66995,618,0002,347,0002,113,536
5May 20, 2026 06:0611,804107,361,19495,638,0002,339,0002,113,536
6May 20, 2026 06:0611,806108,840,86295,648,0002,349,0002,113,536
7May 20, 2026 06:0611,889111,765,95496,611,0002,074,0002,113,536
8May 20, 2026 06:0611,894108,095,23696,663,0002,061,0002,113,536
9May 20, 2026 06:0611,903108,786,80696,740,0002,059,0002,113,536