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:37M-RochatM-RochatScore: 11,903Success
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:3811,792107,269,16495,551,0002,323,0002,113,536
2May 20, 2026 06:3811,821107,947,64995,816,0002,305,0002,113,536
3May 20, 2026 06:3811,884108,096,98996,571,0002,068,0002,113,536
4May 20, 2026 06:3811,890111,262,77196,638,0002,057,0002,113,536
5May 20, 2026 06:3811,903108,960,50196,731,0002,072,0002,113,536
6May 20, 2026 06:3811,911108,591,65896,808,0002,061,0002,113,536
7May 20, 2026 06:3811,912108,868,81896,814,0002,062,0002,113,536
8May 20, 2026 06:3811,919110,021,31996,803,0002,127,0002,113,536
9May 20, 2026 06:3811,920109,024,36196,879,0002,057,0002,113,536