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 5, 2026 23:46wnwnScore: 4,576Success
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 10:004,55760,947,26136,831,000995,0002,494,464
2Mar 6, 2026 10:014,55868,007,93135,838,0001,991,0002,273,280
3Mar 6, 2026 10:004,56762,610,76635,910,0001,995,0002,498,560
4Mar 6, 2026 10:014,57660,663,11735,984,0001,999,0002,494,464
5Mar 6, 2026 10:014,58759,338,73036,065,0002,003,0002,490,368
6Mar 6, 2026 10:004,63759,772,97137,475,0001,012,0002,494,464