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 7, 2026 19:08neel-bhavsarneel-bhavsarScore: 90,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 19:0890,494761,825,163691,325,00059,783,00020,480
2Sep 7, 2026 19:0890,589762,024,911692,255,00059,639,00020,480
3Sep 7, 2026 19:0890,641762,331,394692,850,00059,473,00020,480
4Sep 7, 2026 19:0890,645762,343,674692,605,00059,750,00020,480
5Sep 7, 2026 19:0890,656762,449,014692,517,00059,931,00020,480
6Sep 7, 2026 19:0890,690763,073,094692,412,00060,323,00020,480
7Sep 7, 2026 19:0890,697762,722,598692,791,00060,002,00020,480
8Sep 7, 2026 19:0890,722762,970,821692,933,00060,064,00020,480
9Sep 7, 2026 19:0890,793764,220,008693,173,00060,412,00020,480