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 listOct 24, 2026 15:25timothygktimothygkScore: 12,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 15:3012,027110,785,71978,783,00021,043,0002,117,632stderr
2Oct 24, 2026 15:3012,041110,933,95178,413,00021,529,0002,117,632stderr
3Oct 24, 2026 15:3012,190112,612,82479,466,00021,715,0002,117,632stderr
4Oct 24, 2026 15:3012,230112,475,94579,519,00021,994,0002,117,632stderr
5Oct 24, 2026 15:3012,233113,002,05279,813,00021,721,0002,117,632stderr
6Oct 24, 2026 15:3012,256112,788,07679,372,00022,357,0002,117,632stderr
7Oct 24, 2026 15:3012,598115,654,51383,572,00020,993,0002,117,632stderr
8Oct 24, 2026 15:3012,633115,734,31483,875,00020,985,0002,117,632stderr
9Oct 24, 2026 15:3012,793117,259,10084,589,00021,598,0002,117,632stderr