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 18, 2026 15:15wnwnScore: 8,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 15:158,08795,447,24165,115,0002,003,0002,441,216
2Feb 18, 2026 15:158,14395,954,63966,578,0001,008,0002,453,504
3Feb 18, 2026 15:158,14999,633,24466,625,0001,009,0002,281,472
4Feb 18, 2026 15:158,16892,184,12566,796,000996,0002,277,376
5Feb 18, 2026 15:158,19689,612,11167,027,0001,000,0002,445,312
6Feb 18, 2026 15:158,37295,838,17068,482,0001,007,0002,281,472