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 10:00wnwnScore: 7,255Success
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 10:006,19074,459,71448,352,0003,022,0002,392,064
2Feb 18, 2026 10:006,24575,860,59048,787,0003,049,0002,342,912
3Feb 18, 2026 10:006,28977,453,21248,187,0004,015,0002,392,064
4Feb 18, 2026 10:007,25583,083,36156,205,0004,014,0002,371,584
5Feb 18, 2026 10:007,29595,818,85057,518,0003,027,0002,301,952
6Feb 18, 2026 10:007,39984,051,52558,390,0003,020,0002,408,448