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 13, 2026 21:19Daniel MastalerzDaniel MastalerzScore: 6,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 21:176,62486,962,18050,985,0003,998,0002,326,528
2Feb 13, 2026 21:176,64281,757,07049,115,0006,014,0002,322,432
3Feb 13, 2026 21:196,64885,300,82249,159,0006,019,0002,301,952
4Feb 13, 2026 21:196,65477,812,07953,224,0002,008,0002,310,144
5Feb 13, 2026 21:176,65887,147,19149,232,0006,028,0002,269,184
6Feb 13, 2026 21:196,67478,322,92449,354,0006,043,0002,273,280
7Feb 13, 2026 21:196,74978,915,84652,018,0004,001,0002,387,968
8Feb 13, 2026 21:176,76378,317,45551,122,0005,012,0002,322,432
9Feb 13, 2026 21:176,77783,663,42451,224,0005,022,0002,314,240
10Feb 13, 2026 21:196,78378,022,18853,283,0003,016,0002,334,720
11Feb 13, 2026 21:176,78884,316,85852,318,0004,024,0002,265,088
12Feb 13, 2026 21:196,79277,349,71554,357,0002,013,0002,334,720