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 listMay 25, 2026 15:02Elijah KinElijah KinScore: 43,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 15:0242,839365,228,657354,329,0001,241,0002,113,536
2May 25, 2026 15:0242,867365,709,627354,558,0001,243,0002,113,536
3May 25, 2026 15:0242,871366,289,244354,594,0001,242,0002,113,536
4May 25, 2026 15:0242,896368,900,555354,768,0001,269,0002,113,536
5May 25, 2026 15:0243,213369,767,533357,672,0001,002,0002,113,536
6May 25, 2026 15:0243,257368,997,487357,837,0001,200,0002,113,536
7May 25, 2026 15:0243,260368,998,848358,062,0001,002,0002,113,536
8May 25, 2026 15:0243,281368,724,623358,231,0001,004,0002,113,536
9May 25, 2026 15:0243,602372,849,787360,641,0001,263,0002,113,536