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 listApr 25, 2026 04:38Charles CabergsCharles CabergsScore: 16,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 04:3916,952158,643,716138,708,0001,995,0002,375,680
2Apr 25, 2026 04:3916,966158,650,386138,822,0001,997,0002,363,392
3Apr 25, 2026 04:3916,970158,418,210138,861,0001,998,0002,379,776
4Apr 25, 2026 04:3916,984159,226,526139,974,000999,0002,379,776
5Apr 25, 2026 04:3916,985155,359,635138,979,0001,999,0002,363,392
6Apr 25, 2026 04:3916,999158,301,487140,099,0001,000,0002,375,680
7Apr 25, 2026 04:3917,017158,423,635140,242,0001,001,0002,363,392
8Apr 25, 2026 04:3917,720160,661,785145,083,0002,001,0002,433,024
9Apr 25, 2026 04:3917,783164,809,761146,601,0001,004,0002,363,392