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 20, 2026 14:46Anchen0823Anchen0823Score: 54,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 14:4753,955458,645,000389,639,00058,193,0002,113,536
2Oct 20, 2026 14:4754,004459,105,874389,532,00058,707,0002,113,536
3Oct 20, 2026 14:4754,007459,030,084389,460,00058,799,0002,113,536
4Oct 20, 2026 14:4754,008459,072,605389,479,00058,793,0002,113,536
5Oct 20, 2026 14:4754,024459,182,595389,456,00058,945,0002,113,536
6Oct 20, 2026 14:4754,037459,312,359389,366,00059,146,0002,113,536
7Oct 20, 2026 14:4754,041459,309,704389,445,00059,098,0002,113,536
8Oct 20, 2026 14:4754,094461,218,963389,418,00059,570,0002,113,536
9Oct 20, 2026 14:4754,144460,110,479389,671,00059,729,0002,113,536