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 listJan 23, 2025 16:21Lukas EschbacherLukas EschbacherScore: 166,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 16:21166,5071,409,562,2591,380,013,0001,998,0002,281,472
2Jan 23, 2025 16:21166,5151,411,891,3021,380,073,0001,998,0002,281,472
3Jan 23, 2025 16:21166,5461,408,412,9891,380,332,0001,999,0002,363,392
4Jan 23, 2025 16:21166,5491,415,471,5491,380,357,0001,999,0002,363,392
5Jan 23, 2025 16:21166,5671,406,704,9751,380,506,0001,999,0002,363,392
6Jan 23, 2025 16:21166,7631,414,893,8221,382,137,0001,998,0002,289,664