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 11, 2026 18:19olliecrowolliecrowScore: 6,366Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:195,92076,056,32447,131,0002,005,0002,314,240
2Feb 11, 2026 18:195,93474,546,86347,242,0002,010,0002,310,144
3Feb 11, 2026 18:196,12478,468,91848,839,0001,993,0002,449,408
4Feb 11, 2026 18:196,36681,732,34547,851,0004,984,0002,355,200
5Feb 11, 2026 18:196,43378,339,94952,384,0001,007,0002,510,848
6Feb 11, 2026 18:196,65780,961,85953,244,0002,009,0002,478,080