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 listJun 26, 2026 12:18Victor MerckléVictor MerckléScore: 4,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 12:194,16342,033,77133,442,0001,114,0002,117,632stderr
2Jun 26, 2026 12:194,18042,367,86133,553,0001,149,0002,117,632stderr
3Jun 26, 2026 12:194,18542,164,82333,613,0001,124,0002,117,632stderr
4Jun 26, 2026 12:194,18642,559,26333,640,0001,111,0002,117,632stderr
5Jun 26, 2026 12:194,18742,341,41533,640,0001,113,0002,117,632stderr
6Jun 26, 2026 12:194,18842,590,51333,642,0001,121,0002,117,632stderr
7Jun 26, 2026 12:194,19042,284,43733,640,0001,137,0002,117,632stderr
8Jun 26, 2026 12:194,36844,113,82335,205,0001,056,0002,117,632stderr
9Jun 26, 2026 12:194,38044,179,56835,298,0001,060,0002,117,632stderr