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 listFeb 15, 2026 18:00wnwnScore: 11,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 18:009,814103,855,94874,415,0007,039,0002,441,216
2Feb 15, 2026 18:009,859104,439,60872,851,0008,981,0002,383,872
3Feb 15, 2026 18:0010,149106,339,82276,213,0008,022,0002,277,376
4Feb 15, 2026 18:0011,726120,548,19190,306,0007,023,0002,465,792
5Feb 15, 2026 18:0011,727125,061,33686,298,00011,038,0002,281,472
6Feb 15, 2026 18:0011,737119,016,37188,378,0009,038,0002,449,408
7Feb 15, 2026 18:0011,840123,752,13890,252,0008,022,0002,371,584
8Feb 15, 2026 18:0011,867121,022,53589,452,0009,045,0002,506,752
9Feb 15, 2026 18:0011,879123,568,99689,538,0009,054,0002,465,792
10Feb 15, 2026 18:0011,897127,813,97389,766,0008,976,0002,502,656
11Feb 15, 2026 18:0011,937129,468,49090,069,0009,006,0002,412,544
12Feb 15, 2026 18:0012,057120,853,68593,068,0007,005,0002,277,376