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 listApr 19, 2026 04:39Yuriy LyfenkoYuriy LyfenkoScore: 4,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 04:394,58862,068,54136,078,0002,004,0002,473,984
2Apr 19, 2026 04:374,59164,972,16736,099,0002,005,0002,531,328
3Apr 19, 2026 04:374,60360,201,80536,193,0002,010,0002,478,080
4Apr 19, 2026 04:374,61261,202,42636,269,0002,014,0002,269,184
5Apr 19, 2026 04:394,61867,790,33836,309,0002,017,0002,531,328
6Apr 19, 2026 04:394,76767,021,90538,549,0001,014,0002,535,424