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 10, 2026 17:33Josu San MartinJosu San MartinScore: 5,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 17:334,99964,600,79940,483,0001,012,0002,379,776
2Mar 10, 2026 17:335,03768,805,76539,817,0001,990,0002,281,472
3Mar 10, 2026 17:335,20166,594,91341,160,0002,007,0002,465,792
4Mar 10, 2026 17:335,22067,813,21742,315,0001,007,0002,281,472
5Mar 10, 2026 17:335,36263,271,22543,496,0001,011,0002,281,472
6Mar 10, 2026 17:335,46076,087,06444,314,0001,007,0002,281,472