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 31, 2026 14:41skylookupskylookupScore: 56,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 14:4155,992490,138,508403,770,00060,965,0002,375,680
2Mar 31, 2026 14:4156,016490,223,309411,941,00052,992,0002,379,776
3Mar 31, 2026 14:4156,087495,783,734407,578,00057,940,0002,371,584
4Mar 31, 2026 14:4156,089488,849,841415,586,00049,950,0002,293,760
5Mar 31, 2026 14:4156,093489,491,846405,631,00059,945,0002,379,776
6Mar 31, 2026 14:4156,099492,262,534405,671,00059,951,0002,293,760
7Mar 31, 2026 14:4156,109486,834,727410,738,00054,965,0002,293,760
8Mar 31, 2026 14:4156,120487,813,344407,822,00057,974,0002,367,488
9Mar 31, 2026 14:4156,133495,567,374409,912,00055,988,0002,293,760