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 26, 2025 03:54Tan Lip WeiTan Lip WeiScore: 43,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 26, 2025 03:5443,002379,490,113354,918,0001,999,0002,285,568
2Oct 26, 2025 03:5443,005382,001,944354,939,0001,999,0002,510,848
3Oct 26, 2025 03:5443,006384,564,971355,954,000999,0002,285,568
4Oct 26, 2025 03:5443,012382,319,214355,003,0002,000,0002,285,568
5Oct 26, 2025 03:5443,024378,532,277357,098,00002,285,568
6Oct 26, 2025 03:5443,024381,233,358355,102,0002,000,0002,269,184
7Oct 26, 2025 03:5443,029380,812,929356,140,0001,000,0002,277,376
8Oct 26, 2025 03:5443,035378,805,201355,189,0002,001,0002,265,088
9Oct 26, 2025 03:5443,041385,336,927357,238,00002,519,040