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 listAug 29, 2025 09:21Adam FolwarcznyAdam FolwarcznyScore: 10,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2025 09:2110,513113,251,99049,022,00038,237,0002,408,448
2Aug 29, 2025 09:2110,542115,807,53647,189,00040,307,0002,314,240
3Aug 29, 2025 09:2110,666116,007,84350,167,00038,363,0002,433,024
4Aug 29, 2025 09:2110,682119,401,19849,257,00039,405,0002,400,256
5Aug 29, 2025 09:2110,712112,710,57452,358,00036,552,0002,437,120
6Aug 29, 2025 09:2110,733117,782,70350,482,00038,603,0002,359,296
7Aug 29, 2025 09:2110,740118,860,72649,526,00039,620,0002,510,848
8Aug 29, 2025 09:2110,766119,986,47554,988,00034,367,0002,428,928
9Aug 29, 2025 09:2110,904116,146,13951,155,00039,350,0002,437,120
10Aug 29, 2025 09:2110,930119,248,79352,261,00038,456,0002,433,024
11Aug 29, 2025 09:2110,980118,655,18251,513,00039,625,0002,273,280
12Aug 29, 2025 09:2111,003124,309,24151,065,00040,263,0002,310,144