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 23, 2025 07:45Tan Lip WeiTan Lip WeiScore: 53,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2025 07:1353,774473,139,472385,419,00060,908,0002,285,568
2Oct 23, 2025 07:4553,792475,470,980387,542,00058,930,0002,322,432
3Oct 23, 2025 07:1353,841468,270,376386,897,00059,984,0002,277,376
4Oct 23, 2025 07:1353,898475,276,415387,442,00059,913,0002,285,568
5Oct 23, 2025 07:4553,947469,866,213387,791,00059,967,0002,277,376
6Oct 23, 2025 07:4553,974473,231,743388,985,00058,997,0002,285,568