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 6, 2026 17:28Josu San MartinJosu San MartinScore: 5,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 17:285,04171,023,18039,847,0001,992,0002,506,752
2Mar 6, 2026 17:285,13270,878,61940,569,0002,028,0002,293,760
3Mar 6, 2026 17:285,24162,190,49741,474,0002,023,0002,502,656
4Mar 6, 2026 17:285,39670,610,42343,788,000995,0002,293,760
5Mar 6, 2026 17:285,43170,216,53742,074,0003,005,0002,277,376
6Mar 6, 2026 17:285,45668,057,98642,267,0003,019,0002,293,760