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 27, 2026 10:40Ignas BagdonasIgnas BagdonasScore: 9,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 10:409,626103,046,61678,894,000998,0002,527,232
2Mar 27, 2026 10:409,630102,718,04377,929,0001,998,0002,293,760
3Mar 27, 2026 10:409,630103,479,91477,935,0001,998,0002,293,760
4Mar 27, 2026 10:409,630104,979,97677,935,0001,998,0002,273,280
5Mar 27, 2026 10:409,634106,909,75878,963,000999,0002,273,280
6Mar 27, 2026 10:409,634103,569,71277,962,0001,999,0002,293,760
7Mar 27, 2026 10:409,635104,312,33777,968,0001,999,0002,293,760
8Mar 27, 2026 10:409,635102,723,47577,971,0001,999,0002,273,280
9Mar 27, 2026 10:409,639101,725,62278,001,0002,000,0002,269,184