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 listSep 24, 2026 05:45wnwnScore: 4,193Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 05:514,09342,725,80026,902,0007,074,00020,480
2Sep 24, 2026 05:514,10542,694,94427,004,0007,071,00020,480
3Sep 24, 2026 05:514,16743,350,33227,047,0007,541,0002,113,536
4Sep 24, 2026 05:514,17843,421,02726,951,0007,731,0002,113,536
5Sep 24, 2026 05:514,19344,835,64827,470,0007,332,00020,480
6Sep 24, 2026 05:514,19643,592,90926,886,0007,941,00020,480
7Sep 24, 2026 05:514,31044,514,16526,918,0008,861,0002,113,536
8Sep 24, 2026 05:514,38345,063,52528,454,0007,929,0002,113,536
9Sep 24, 2026 05:514,38445,827,41328,522,0007,870,00020,480