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 listOct 2, 2026 08:01Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 08:01039,963,08329,856,0001,085,0002,113,536expected "53680549190217298 ", got "279 137 29597 JLOJIIKQIMSUKHLHJNIPMRMMMJINNMJKGKHLHHJKIKGIGGHO]HKIHPOHLHKIMGQJ "
2Oct 2, 2026 08:01039,829,96629,768,0001,073,0002,113,536expected "53682627297319522 ", got "267 140 29474 QKIOzPMKNIIYIJNHNNJKKUIKKLOILIJOPLHHMGLLKJHPHIJHWJHHHHNHLKVHHLQK "
3Oct 2, 2026 08:01039,824,79729,698,0001,072,0002,113,536expected "53691741896801004 ", got "266 136 29440 LHSIJJIMIIHSILLMMRKLIUPQPHMLMLLLLHMMHOHJMIIJKKHLVILHOOOKHMHMOORL "