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 listMar 16, 2026 05:37KeefeKeefeScore: 7,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 05:377,53088,968,28562,496,00002,310,144
2Mar 16, 2026 05:377,58093,376,12060,921,0001,997,0002,445,312
3Mar 16, 2026 05:377,58689,462,03961,967,000999,0002,416,640
4Mar 16, 2026 05:377,59289,889,39861,013,0002,000,0002,441,216
5Mar 16, 2026 05:377,59389,648,38561,024,0002,000,0002,400,256
6Mar 16, 2026 05:377,59985,726,91061,070,0002,002,0002,445,312
7Mar 16, 2026 05:377,60189,165,23460,084,0003,004,0002,445,312
8Mar 16, 2026 05:377,61491,888,39060,190,0003,009,0002,416,640
9Mar 16, 2026 05:377,73586,358,72962,192,0002,006,0002,387,968