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 31, 2025 21:32Adam FolwarcznyAdam FolwarcznyScore: 7,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2025 21:327,80988,028,65947,861,00016,951,0002,281,472
2Aug 31, 2025 21:327,84090,485,55647,051,00018,019,0002,531,328
3Aug 31, 2025 21:327,86582,542,10646,199,00019,082,0002,277,376
4Aug 31, 2025 21:327,90489,031,38947,435,00018,166,0002,330,624
5Aug 31, 2025 21:327,90492,215,55252,484,00013,121,0002,510,848
6Aug 31, 2025 21:327,92787,406,60249,843,00015,950,0002,531,328
7Aug 31, 2025 21:327,92792,291,40749,843,00015,949,0002,404,352
8Aug 31, 2025 21:327,93184,680,95548,874,00016,956,0002,310,144
9Aug 31, 2025 21:327,93991,156,07449,918,00015,973,0002,412,544
10Aug 31, 2025 21:327,96686,583,13852,091,00014,024,0002,408,448
11Aug 31, 2025 21:328,02693,016,81451,477,00015,140,0002,277,376
12Aug 31, 2025 21:328,05287,032,89851,872,00014,963,0002,277,376