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 22, 2026 11:52wnwnScore: 3,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 11:523,60646,381,29028,935,000997,0002,486,272
2Apr 22, 2026 11:523,61447,730,73228,002,0002,000,0002,473,984
3Apr 22, 2026 11:523,62642,462,62329,095,0001,003,0002,478,080
4Apr 22, 2026 11:523,62946,165,96528,117,0002,008,0002,490,368
5Apr 22, 2026 11:523,64150,860,13429,219,0001,007,0002,482,176
6Apr 22, 2026 11:523,66548,405,52729,409,0001,014,0002,482,176
7Apr 22, 2026 11:523,70744,063,59628,784,0001,985,0002,478,080
8Apr 22, 2026 11:523,72349,705,78428,910,0001,993,0002,482,176
9Apr 22, 2026 11:523,78946,398,73930,439,0001,014,0002,486,272