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 25, 2025 10:30Wookyung JeongWookyung JeongScore: 52,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 10:3052,839465,097,227437,565,000999,0002,523,136
2Sep 25, 2025 10:3052,841461,604,354437,585,000999,0002,289,664
3Sep 25, 2025 10:3052,843463,685,086436,597,0001,998,0002,281,472
4Sep 25, 2025 10:3052,845460,480,465436,616,0001,998,0002,289,664
5Sep 25, 2025 10:3052,846470,160,137436,627,0001,998,0002,269,184
6Sep 25, 2025 10:3052,847464,681,982436,634,0001,998,0002,269,184
7Sep 25, 2025 10:3052,850462,786,400437,658,000999,0002,273,280
8Sep 25, 2025 10:3052,851467,881,886437,661,000999,0002,289,664
9Sep 25, 2025 10:3052,865466,501,197437,780,000999,0002,281,472