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 listMar 19, 2026 00:49Ondřej PolaneckýOndřej PolaneckýScore: 18,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 00:4918,073179,476,900147,004,0003,000,0002,433,024
2Mar 19, 2026 00:4918,105187,712,602147,269,0003,005,0002,482,176
3Mar 19, 2026 00:4918,142178,402,655148,586,0001,994,0002,441,216