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 listAug 11, 2026 15:34RabenknechtRabenknechtScore: 52,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 15:3451,384436,561,191425,427,0001,066,0002,113,536
2Aug 11, 2026 15:3451,467437,226,411426,157,0001,026,0002,113,536
3Aug 11, 2026 15:3451,746439,492,409428,427,0001,071,0002,113,536
4Aug 11, 2026 15:3452,135442,776,957431,618,0001,106,0002,113,536
5Aug 11, 2026 15:3452,140443,915,430431,761,0001,001,0002,113,536
6Aug 11, 2026 15:3452,143442,930,931431,682,0001,107,0002,113,536
7Aug 11, 2026 15:3452,146442,899,602431,759,0001,054,0002,113,536
8Aug 11, 2026 15:3452,155442,979,855431,810,0001,079,0002,113,536
9Aug 11, 2026 15:3452,174443,122,894431,987,0001,058,0002,113,536