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 listJan 10, 2026 18:43Alexander FrolovAlexander FrolovScore: 26,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 18:4326,104243,227,921214,666,0001,996,0002,277,376
2Jan 10, 2026 18:4326,111243,814,785214,727,0001,997,0002,490,368
3Jan 10, 2026 18:4326,111242,948,197214,725,0001,997,0002,478,080
4Jan 10, 2026 18:4326,117245,307,681214,778,0001,997,0002,277,376
5Jan 10, 2026 18:4326,128239,783,121214,864,0001,998,0002,277,376
6Jan 10, 2026 18:4326,131241,434,406214,889,0001,998,0002,277,376
7Jan 10, 2026 18:4326,139237,701,540214,952,0001,999,0002,486,272
8Jan 10, 2026 18:4326,296239,946,002217,259,0001,001,0002,277,376
9Jan 10, 2026 18:4326,309243,810,979217,360,0001,001,0002,486,272