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 31, 2026 14:46Yuriy LyfenkoYuriy LyfenkoScore: 4,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 14:464,62668,488,36037,388,0001,010,0002,535,424
2Mar 31, 2026 14:464,88260,213,76939,506,0001,012,0002,461,696
3Mar 31, 2026 14:464,89363,919,86339,600,0001,015,0002,465,792