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 listApr 1, 2026 12:02zielajzielajScore: 3,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 12:023,41051,014,58727,293,0001,010,0002,523,136
2Apr 1, 2026 12:023,41153,193,19427,304,0001,011,0002,523,136
3Apr 1, 2026 12:023,41347,303,36527,313,0001,011,0002,424,832
4Apr 1, 2026 12:023,42553,145,20426,394,0002,030,0002,519,040
5Apr 1, 2026 12:023,43151,418,99327,463,0001,017,0002,437,120
6Apr 1, 2026 12:023,51850,552,60827,186,0002,013,0002,482,176