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 listSep 6, 2026 03:00CheckHarryCheckHarryScore: 4,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:024,08243,716,51132,877,0001,009,0002,113,536
2Sep 6, 2026 03:024,08243,743,37732,871,0001,017,0002,113,536
3Sep 6, 2026 03:024,08243,717,72632,880,0001,007,0002,113,536
4Sep 6, 2026 03:024,08643,756,25732,894,0001,020,0002,113,536
5Sep 6, 2026 03:024,08643,798,67132,912,0001,010,0002,113,536
6Sep 6, 2026 03:024,09443,905,03332,973,0001,008,0002,113,536
7Sep 6, 2026 03:024,10744,091,45533,086,0001,008,0002,113,536
8Sep 6, 2026 03:024,26545,330,47434,386,0001,014,0002,113,536
9Sep 6, 2026 03:024,27545,353,75434,459,0001,025,0002,113,536