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 listDec 6, 2025 15:49Rajarshi BasuRajarshi BasuScore: 6,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 15:496,12877,060,87148,868,0001,994,0002,289,664
2Dec 6, 2025 15:316,13174,860,09649,887,000997,0002,367,488
3Dec 6, 2025 15:316,13873,879,03048,947,0001,997,0002,289,664
4Dec 6, 2025 15:496,14374,778,90148,984,0001,999,0002,289,664
5Dec 6, 2025 15:496,24379,336,17448,829,0002,989,0002,281,472
6Dec 6, 2025 15:316,24474,681,40249,830,0001,993,0002,293,760
7Dec 6, 2025 15:496,26578,752,34450,002,0002,000,0002,289,664
8Dec 6, 2025 15:316,27378,556,57151,063,0001,001,0002,289,664
9Dec 6, 2025 15:316,28275,724,07950,137,0002,005,0002,281,472
10Dec 6, 2025 15:316,28774,371,66151,179,0001,003,0002,277,376
11Dec 6, 2025 15:496,29377,886,08951,224,0001,004,0002,289,664
12Dec 6, 2025 15:496,41274,710,21251,214,0002,008,0002,289,664