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:08FrederickFrederickScore: 8,678Success
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:098,62582,289,78369,568,0002,026,0002,117,632
2Oct 5, 2026 02:098,63282,102,54669,644,0002,003,0002,117,632
3Oct 5, 2026 02:098,64882,974,35569,734,0002,052,0002,117,632
4Oct 5, 2026 02:098,66083,074,26869,836,0002,047,0002,117,632
5Oct 5, 2026 02:098,67882,419,92170,002,0002,031,0002,117,632
6Oct 5, 2026 02:098,69882,644,43570,164,0002,031,0002,117,632
7Oct 5, 2026 02:098,75783,279,91370,654,0002,030,0002,117,632
8Oct 5, 2026 02:098,85484,702,33371,433,0002,059,0002,117,632
9Oct 5, 2026 02:099,29787,568,45075,118,0002,051,0002,117,632