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 listJul 24, 2025 18:38Leon ZhaoLeon ZhaoScore: 66,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2025 18:3865,753575,574,927543,750,0001,999,0002,379,776
2Jul 24, 2025 18:3866,748583,026,752553,012,0001,000,0002,392,064
3Jul 24, 2025 18:3866,827583,284,338552,669,0001,998,0002,396,160