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 17, 2026 14:46Yuriy LyfenkoYuriy LyfenkoScore: 9,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:469,130103,760,68667,804,0007,977,0002,506,752
2Mar 17, 2026 14:469,136100,619,13364,854,00010,975,0002,289,664
3Mar 17, 2026 14:469,193103,294,74967,267,0009,035,0002,482,176