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 listOct 15, 2026 11:06timothygktimothygkScore: 150,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 11:07150,5991,260,480,3651,021,816,000228,156,0002,113,536
2Oct 15, 2026 11:07150,6061,260,505,9791,021,776,000228,254,0002,113,536
3Oct 15, 2026 11:07150,7021,261,600,2601,021,777,000229,052,0002,113,536
4Oct 15, 2026 11:07150,7081,261,328,5101,021,778,000229,104,0002,113,536
5Oct 15, 2026 11:07150,7231,261,473,3911,021,816,000229,193,0002,113,536
6Oct 15, 2026 11:07150,7351,261,673,8401,021,840,000229,262,0002,113,536
7Oct 15, 2026 11:07150,7581,262,405,3991,021,756,000229,541,0002,113,536
8Oct 15, 2026 11:07150,7761,262,072,2201,021,757,000229,692,0002,113,536
9Oct 15, 2026 11:07151,2251,265,827,2111,021,809,000233,361,0002,113,536