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 listJan 2, 2026 04:13Josu San MartinJosu San MartinScore: 7,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:147,33683,012,90159,894,000998,0002,457,600
2Jan 2, 2026 04:147,36183,015,03259,096,0002,003,0002,445,312
3Jan 2, 2026 04:147,38784,049,38158,294,0003,015,0002,428,928
4Jan 2, 2026 04:147,39287,313,05659,344,0002,011,0002,310,144
5Jan 2, 2026 04:137,39482,810,87259,360,0002,012,0002,289,664
6Jan 2, 2026 04:147,40986,185,56757,463,0004,032,0002,383,872
7Jan 2, 2026 04:137,41791,036,39259,544,0002,018,0002,494,464
8Jan 2, 2026 04:137,44694,835,44261,799,00002,375,680
9Jan 2, 2026 04:137,44986,180,55458,833,0002,991,0002,297,856
10Jan 2, 2026 04:147,47485,118,06059,036,0003,001,0002,338,816
11Jan 2, 2026 04:137,51083,889,17059,317,0003,016,0002,318,336
12Jan 2, 2026 04:137,60993,022,93060,150,0003,007,0002,461,696