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 27, 2025 09:05SinaSinaScore: 122,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 09:05121,4521,039,088,159782,265,000225,788,0002,277,376
2Sep 27, 2025 09:05121,6221,034,066,114782,584,000226,879,0002,441,216
3Sep 27, 2025 09:05122,0891,036,087,091783,488,000229,850,0002,322,432
4Sep 27, 2025 09:05122,1081,039,066,892782,609,000230,884,0002,453,504
5Sep 27, 2025 09:05122,2091,039,514,596782,485,000231,847,0002,396,160
6Sep 27, 2025 09:05122,3921,044,567,804783,115,000232,737,0002,461,696
7Sep 27, 2025 09:05122,4351,041,328,500782,390,000233,817,0002,519,040
8Sep 27, 2025 09:05122,5171,043,946,757782,148,000234,744,0002,359,296
9Sep 27, 2025 09:05122,7361,050,482,948784,005,000234,702,0002,277,376