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 5, 2026 02:18FrederickFrederickScore: 8,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:188,56581,556,31670,072,0001,019,0002,117,632
2Oct 5, 2026 02:188,60181,886,62270,375,0001,014,0002,117,632
3Oct 5, 2026 02:188,62182,083,05570,540,0001,015,0002,117,632
4Oct 5, 2026 02:188,66083,058,01169,856,0002,028,0002,117,632
5Oct 5, 2026 02:188,69982,880,80470,175,0002,027,0002,117,632
6Oct 5, 2026 02:188,70483,390,22571,234,0001,015,0002,117,632
7Oct 5, 2026 02:188,83384,109,78871,285,0002,030,0002,117,632
8Oct 5, 2026 02:188,97085,584,35673,434,0001,023,0002,117,632
9Oct 5, 2026 02:189,05385,852,49173,128,0002,019,0002,117,632