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 14, 2026 17:46timothygktimothygkScore: 89,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 17:4789,002749,246,391679,806,00058,911,0002,113,536
2Oct 14, 2026 17:4789,009749,176,779680,116,00058,664,0002,113,536
3Oct 14, 2026 17:4789,013749,202,886679,953,00058,861,0002,113,536
4Oct 14, 2026 17:4789,015749,162,852680,152,00058,674,0002,113,536
5Oct 14, 2026 17:4789,026749,376,045679,771,00059,148,0002,113,536
6Oct 14, 2026 17:4789,029749,382,474679,925,00059,019,0002,113,536
7Oct 14, 2026 17:4789,071749,660,559680,103,00059,189,0002,113,536
8Oct 14, 2026 17:4789,072749,877,463679,251,00060,047,0002,113,536
9Oct 14, 2026 17:4789,077749,710,702680,216,00059,128,0002,113,536