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 13, 2026 14:44Dominique GarmierDominique GarmierScore: 12,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 14:4412,039128,411,53296,928,0002,997,0002,289,664
2Mar 13, 2026 14:4412,062127,713,02497,115,0003,003,0002,281,472
3Mar 13, 2026 14:4412,078120,603,06397,244,0003,007,0002,269,184
4Mar 13, 2026 14:4412,085123,072,35998,302,0002,006,0002,289,664
5Mar 13, 2026 14:4412,086128,801,96897,307,0003,009,0002,289,664
6Mar 13, 2026 14:4412,089124,060,06297,326,0003,010,0002,289,664
7Mar 13, 2026 14:4412,147127,529,22097,830,0002,994,0002,277,376
8Mar 13, 2026 14:4412,213128,262,46999,360,0002,007,0002,273,280
9Mar 13, 2026 14:4412,304130,427,20499,120,0003,003,0002,289,664