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 03:32Charles CabergsCharles CabergsScore: 17,746Success
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 03:3217,713164,242,649145,018,0002,000,0002,367,488
2Apr 25, 2026 03:3217,717170,213,825145,054,0002,000,0002,371,584
3Apr 25, 2026 03:3217,742167,144,860146,263,0001,001,0002,297,856
4Apr 25, 2026 03:3217,742163,844,024147,261,00002,363,392
5Apr 25, 2026 03:3217,746164,817,874146,291,0001,001,0002,293,760
6Apr 25, 2026 03:3218,040168,371,893147,743,0001,996,0002,367,488
7Apr 25, 2026 03:3218,114164,054,377149,350,0001,002,0002,306,048
8Apr 25, 2026 03:3218,114168,189,944149,349,0001,002,0002,359,296
9Apr 25, 2026 03:3218,128166,115,780149,465,0001,003,0002,375,680