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 listJul 5, 2026 13:22Teow Hua JunTeow Hua JunScore: 14,031Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:2314,019125,792,813114,180,0002,184,0002,117,632
2Jul 5, 2026 13:2314,022125,819,082114,348,0002,041,0002,117,632
3Jul 5, 2026 13:2314,026125,853,544114,307,0002,116,0002,117,632
4Jul 5, 2026 13:2314,028125,894,170114,336,0002,104,0002,117,632
5Jul 5, 2026 13:2314,031125,830,789114,365,0002,094,0002,117,632
6Jul 5, 2026 13:2314,038125,897,627114,488,0002,032,0002,117,632
7Jul 5, 2026 13:2314,050126,019,870114,469,0002,151,0002,117,632
8Jul 5, 2026 13:2314,084126,341,751114,884,0002,021,0002,117,632
9Jul 5, 2026 13:2314,570130,333,018118,915,0002,021,0002,117,632